Weak Aggregative Modal Logics with Multi-ary Modal Operators
نویسنده
چکیده
In this paper we generalize the Apostoli-Brown strategy developed in 1] to show the completeness of a descending chain of weak aggregative modal logics with multi-ary modal operators. The logics presented here are generalization of the weak aggregative unary modal logics developed by Jennings and Schotch in the 80's.
منابع مشابه
Weakly Aggregative Modal Logic: Characterization and Interpolation
In this paper, we study the model theoretical aspects of Weakly Aggregative Modal Logic (WAML), which is a collection of disguised polyadic modal logics with n-ary modalities whose arguments are all the same. We give a van-Benthem-Rosen characterization theorem of WAML based on an intuitive notion of bisimulation, and show that WAML has Craig Interpolation.
متن کاملCooperation and Defection in a Generalized Modal Setting
A modal logical schema is introduced for the exploration of a multi-player generalization of the Prisoner’s Dilemma in which (a) each participant has at least k available moves, and (b) participants can be members of more than one coalition of successful participants. The methodology employed illustrates how the principle governing the aggregative behaviour of formulae within the scope of the 2...
متن کاملA Multi-Dimensional Terminological Knowledge Representation Language
An extension of the concept description language ACC used in KL-ONE-like terminological reasoning is presented. The extension includes multi-modal operators that can either stand for the usual role quantifications or for modalities such as belief, time etc. The modal operators can be used at all levels of the concept terms, and they can be used to modify both concepts and roles. This is an inst...
متن کاملAggregative combinatorics: An introduction
This paper is an exploratory introduction to issues surrounding the combinatorial expressivity and computational complexity of weakly aggregative modal logic (WAL) – the latter insofar as it relates to the former, but also more generally. We begin by showing how WAL allows us to define a natural hierarchy of (recognition) optimization problems not generally available in logics as strong as K. I...
متن کاملLabelled Tableaux for Multi-Modal Logics
In this paper we present a tableau-like proof system for multi-modal logics based on D’Agostino and Mondadori’s classical refutation system KE [DM94]. The proposed system, that we call KEM , works for the logics S5A and S5P(n) which have been devised by Mayer and van der Hoek [MvH92] for formalizing the notions of actuality and preference. We shall also show howKEM works with the normal modal l...
متن کامل